Spaces allowing Type-2 Complexity Theory revisited
نویسنده
چکیده
The basic concept of Type-2 Theory of Effectivity (TTE) to define computability on topological spaces ¢. Representations having the topological property of admissibility are known to provide a reasonable computability theory. In this article, we investigate several additional properties of representations which guarantee that such representations induce a reasonable Type-2 complexity theory on the represented spaces. For each of these properties, we give a nice characterization of the class of spaces that are equipped with a representation having the respective property.
منابع مشابه
Some Examples of Non-Metrizable Spaces Allowing a Simple Type-2 Complexity Theory
Representations of spaces are the key device in Type-2 Theory of Effectivity (TTE) for defining computability on non-countable spaces. Almost-compact representations permit a simple measurement of the time complexity of functions using discrete parameters, namely the desired output precision together with “size” information about the argument, rather than continuous ones. We present some intere...
متن کاملComplexity Spaces Revisited
The complexity (quasi-pseudo-metric) spaces have been introduced as part of the development of a topological foundation for the complexity analysis of algorithms ((Sch95]). Applications of this theory to the complexity analysis of Divide & Conquer algorithms have been discussed in Sch95]. Typically these applications involve xed point arguments based on the Smyth completion. The notion of S-com...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملAn Intelligent Theory of Cost for Partial Metric Spaces
Partial metric spaces generalise metric spaces, allowing non zero self distance. This is needed to model computable partial information, but falls short in an important respect. The present cost of computing information, such as processor time or memory used, is rarely expressible in domain theory, but contemporary theories of algorithms incorporate precise control over cost of computing resour...
متن کاملGrüss Type Discrete Inequalities in Inner Product Spaces, Revisited
Some sharp inequalities of Grüss type for sequences of vectors in real or complex inner product spaces are obtained. Applications for Jensen's inequality for convex functions defined on such spaces are also provided.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Log. Q.
دوره 50 شماره
صفحات -
تاریخ انتشار 2004